Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs
نویسندگان
چکیده
HAO HUANG1† , J IE MA, ASAF SHAPIRA3‡, BENNY SUDAKOV4§ and RAPHAEL YUSTER 1Department of Mathematics, UCLA, Los Angeles, CA 90095, USA (e-mail: [email protected]) 2Department of Mathematics, UCLA, Los Angeles, CA 90095, USA (e-mail: [email protected]) 3School of Mathematics, Tel Aviv University, Tel Aviv 69978, Israel (e-mail: [email protected]) 4Department of Mathematics, ETH, 8092 Zurich, Switzerland and Department of Mathematics, UCLA, Los Angeles, CA 90095, USA (e-mail: [email protected]) 5Department of Mathematics, University of Haifa, Haifa 31905, Israel (e-mail: [email protected])
منابع مشابه
Arc-Disjoint Cycles and Feedback Arc Sets
Isaak posed the following problem. Suppose T is a tournament having a minimum feedback arc set which induces an acyclic digraph with a hamiltonian path. Is it true that the maximum number of arc-disjoint cycles in T equals the cardinality of minimum feedback arc set of T? We prove that the answer to the problem is in the negative. Further, we study the number of arc-disjoint cycles through a ve...
متن کامل0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملFeedback arc set problem and NP-hardness of minimum recurrent configuration problem of Chip-firing game on directed graphs
In this paper we present further studies of recurrent configurations of Chip-firing games on Eulerian directed graphs (simple digraphs), a class on the way from undirected graphs to general directed graphs. A computational problem that arises naturally from this model is to find the minimum number of chips of a recurrent configuration, which we call the minimum recurrent configuration (MINREC) ...
متن کاملComplete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set
A feedback arc set of a digraph is a set of arcs whose reversal makes the resulting digraph acyclic. Given a tournament with a disjoint union of directed paths as a feedback arc set, we present necessary and sufficient conditions for this feedback arc set to have minimum size. We will present a construction for tournaments where the difference between the size of a minimum feedback arc set and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 22 شماره
صفحات -
تاریخ انتشار 2013